Dynamically stable matching

Dynamically stable preferences

In the framework of dynamic choice under uncertainty, we define dynamic stability as a combination of two assumptions prevalent in the literature: dynamic consistency and the requirement that updated preferences belong to the same class as ex ante ones. Maxmin preferences are shown to be not dynamically stable, and any dynamically stable subset in that class can contain only expected utility pr...

Stable Matching

Efficient Matching of Dynamically Changing Graphs

Dynamically-Stable Motion Planning for Humanoid Robots

We present an algorithm for computing stable collision-free motions for humanoid robots given fullbody posture goals. The motion planner is part of a simulation environment under development for providing high-level software control for humanoid robots. Given a robot’s internal model of the environment and a statically-stable desired posture, we use a randomized path planner to search the confi...

Dynamically stable sets in infinite strategy spaces

Evolutionary game theory has largely focused on finite games. Dynamic stability is harder to attain in infinite strategy spaces; Bomze (Monatshefte für Mathematik 110, 1990, 189–206) and Oechssler and Riedel (Economic Theory 17, 2001, 141–162) provide conditions for the stability of rest points under the replicator dynamics. Here, conditions are given for the stability of sets of strategies und...